SPO and DPO graph rewriting with Petri nets having read , inhibitor and reset arcs ?
نویسندگان
چکیده
It belongs to the folklore that graph grammars can be seen as a proper generalisation of Petri nets. In this paper we show how this intuitive relationship can be made formal. The double-pushout approach to graph rewriting turns out to be strictly related to Petri nets with read and inhibitor arcs, while the single-pushout approach has strong connections to Petri nets with read and reset arcs.
منابع مشابه
Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars
Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...
متن کاملEvent Structure Semantics for Dynamic Contextual Nets?
Petri nets and Graph Transformation Systems (GTSs) are two well-known models for concurrent systems. Petri nets, conceptually simpler, had became a reference model for experimenting with and developing new semantic approaches to concurrency, notably non-sequential processes, unfolding constructions, event structures and algebraic models. Graph Transformation Systems provide a more sophisticated...
متن کاملReduction rules for reset/inhibitor nets
Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancelation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive ...
متن کاملFlexible Independence of Net Transformations and Token Firing in the Cospan DPO Approach
The double pushout (DPO) approach for graph transformation has been applied already to Petri nets in order to model rule based transformations of the net structure. Recently, as alternative to the classical DPO approach, the cospan DPO approach has been proposed where rules are cospans instead of spans. Although the cospan DPO approach has been shown to be equivalent to the classical DPO approa...
متن کاملGraph Transformation with Time: Causality and Logical Clocks
Following TER nets, an approach to the modelling of time in high-level Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised to graph transformation systems and semantic variations are discussed. They are summarised by a gen...
متن کامل